Method for estimating channels in two-hop MIMO AF networks

ABSTRACT

A method estimates interim channels in a two-hop multi-input-multi-output (MIMO) amplify-and-forward (AF) relay network including a source station (SS), a relay station (RS), and a destination station (DS). The estimate is according to the overall channel obtained at the DS or the SS. By varying an amplifying matrix of the RS over time, the method establishes a linear equation group with respect to the elements of the interim channels over the first (SS-RS) and second (RS-SS) hops, based on which low-complexity estimation of the interim channels is performed.

FIELD OF THE INVENTION

This invention relates generally to cooperative communication in relay networks, and more particularly to estimating channels in two-hop multi-input-multi-output (MIMO) amplify-and-forward (AF) networks.

BACKGROUND OF THE INVENTION

Cooperative communication is regarded as one important technique in next generation wireless communication networks. A minimal single-user cooperative communication network includes a source station (SS), a relay station (RS), and a destination station (DS). As a repeater, the RS receives signals transmitted by the SS, performs appropriate signal processing, and then relays the signals to the DS. Relay techniques can increase the coverage, decrease overall transmit power, and improve reliability of the communication links with the help of multiple independent paths under multi-rely case.

Relaying modes can be broadly categorized as decode-and-forward (DF) and amplify-and forward (AF). In the DF mode, the RS demodulates the received signals, decodes the encoded data in the signals, re-encodes and re-modulates the data, and forwards the signal to the DS. In the AF mode, the RS only amplifies and forwards the received signals without decoding. Thus, the AF mode is simpler to implementation than the DF mode, and hence provides a tradeoff between performance and complexity.

In a relay-based two-hop cooperative communication network, the SS and the RS can concurrently transmit signals using the same channel, i.e., frequency subcarrier band, while the signals are detected jointly by the DS. Alternatively, the signals are transmitted using two orthogonal channels by means of time-division or frequency-division to avoid interference. In either case, cooperative diversity can be achieved by allowing the DS to concurrently receive signals from both the SS and RS.

In a scattering environment, multi-path fading varies significantly on the scale of half a wavelength. Multi-input-multi-output (MIMO) techniques use multiple antennas at both the transmitter and receiver to take advantage of the inherent spatial diversity in wireless channels. MIMO techniques are widely used to enhance the spectrum efficiency and reliability of wireless communication networks. It is desired to combine relay and MIMO techniques.

In a two-hop AF relay MIMO network, the overall channel from the SS to the DS is a combination of two interim channels. The first interim channel is from the SS to the RS, and the second interim channel is from the RS to the DS.

Conventionally, the overall channel form the SS to the DS can only be estimated directly by using pilot signals that are transmitted from the SS to the DS. However, in a typical two-hop MIMO AF relay network with simple relay nodes, the RS does not explicitly decode and retransmit pilot signals to the DS, because the RS only amplifies and forwards. As a result, the interim channels cannot be estimated directly by the DS based on pilot signals. However, the performance of the two-hop MIMO AF relay network can be significantly improved if channel state information (CSI) would be available for the interim channels. Then, the transmitters select the optimal antennas to maximize throughput and reduce errors.

Therefore, it is desired to provide a low-complexity method that estimates the CSI for the interim channels at a DS in a two-hop MIMO AF relay network without using pilot signals.

SUMMARY OF THE INVENTION

The object of the present invention is to estimate channel state information (CSI) for channels in a two-hop multi-input- multi-output (MIMO) amplify-and-forward (AF) relay network without explicitly using pilot signals. The network includes a source station (SS), a relay station (RS), and a destination station (DS). The channels include a first interim channel from the SS to the RS, a second interim channel from the RS to the DS, and an overall channel from the SS to the DS. The channels are estimated at the DS.

By varying a power amplifying matrix P at the relay station (RS) during several consecutive time intervals as signals are transmitted from a source station (SS) to a destination station (DS), different CSI for the overall channel that includes the interim channels can be estimated at the DS.

These estimated CSI are initially in a form of a set of non-linear equations. The non-linear equations are transformed to a single linear equation. Then, the linear equation is solved to yield the channel estimates. The channel estimates can be used by transmitters at the SS and the RS to optimally select antennas.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic of a two-hop multi-input multi-output amplify-and-forward relay network operating according to the embodiments of the invention;

FIG. 2 is a block diagram of the network of FIG. 1 including wireless channels according to embodiments of the invention;

FIG. 3 is a timing diagram of channel estimation for interim channels according to embodiments of the invention; and

FIG. 4 is a flow diagram of channel estimation according to embodiment of the invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

FIG. 1 shows a two-hop multi-input multi-output (MIMO) amplify-and-forward (AF) relay network 100 operating according to embodiments of our invention. The wireless network can be a local area network (LAN), a metropolitan area network (MAN), or in a cellular network. The network includes a base station (BS) 101, a relay station (RS), and a mobile station (MS). It should be understood that there could be multiple RS and MS. The BS is stationary, the RSs can be fixed, move occasionally (nomadic), or mobile. The MS typically is mobile. Depending on the direction of communication, the BS or the MS can either be a source station (SS) 201 or a destination station (DS) 203, see FIG. 2.

In this network, there is an overall channel 110, a first interim channel 111 from the SS to the RS, and a second interim channel from the RS to the DS. Because the AF RS does not transmit pilot signals that could be used for channel estimation, the interim channels 111-112 are estimated from the overall channel 110.

FIG. 2 shows the network of FIG. 1 as well as the channels 210 between the various transmit (TX) and receive (RX) antennas 211. There are N_(s) transmit antennas at the SS 201, N_(r) receive and transmit antenna pairs at the relay station (RS) 102, and N_(d) receive antennas at the DS 203. Data between the SS and DS are communicated via the RS, using two orthogonal interim channels, one interim channel from the source to relay (SS-RS), and the other from the RS to the DS. The transmitters can use time-division multiplexing, frequency-division multiplexing, or code-division multiple access.

A N_(r)×N_(s) non-singular channel matrix for the channel 111 between the SS and the RS is H₁ 204. An invertible N_(r)×N_(r) power amplifying matrix at the RS is P 205, and a N_(d)×N_(r) non-singular channel matrix for the channel 112 between the RS and the DS is H₂. Both matrices H₁ and H₂ denote flat fading channels on a narrow spectrum band, such as an orthogonal frequency division multiplexing (OFDM) subcarrier. The N_(d)×N_(S) channel matrix for the overall channel 110 between the SS and the DS is H_(O)=H₂PH₁   (1) we estimate the interim channels, αH₁ and

$\frac{H_{2}}{\alpha}$ using observations of the overall channel 110, where α is an arbitrary complex number. These estimates are obtained from knowledge of the amplifying matrix P 205, and the corresponding estimated overall channel H_(EO). Then, we can determine the channel matrices H₁ and H₂.

Estimation of H₁ and H₂ When N_(r)=min{N_(s), N_(d)}

FIG. 3 schematically shows the timing for estimating the interim channels of our two-hop MIMO AF relay network. Here, the number of antennas N_(r) at the RS is min{N_(S), N_(d)}.

The fundamental idea of our invention is to vary the amplifying matrices P_(L) 205 during consecutive time intervals 301 as signals are relayed so that multiple matrix equations, with respect to H₁ and H₂ can be obtained. The multiple equations are used to determine αH₁ and

$\frac{H_{2}}{\alpha} \cdot$

That is, the RS changes the amplifying matrix P in a predetermined manner over time while receiving and transmitting signals so that the DS can detect a sequence of overall channels H_(EO), each of which can be used to determine the interim channels H₁ and H₂.

In FIG. 3, Δτ 302 denotes the time when the DS estimates the overall channel for each of L consecutive time intervals 302, and {P_(l),1≦l≦L} denotes a sequence of amplification matrices used during the corresponding L consecutive time intervals.

The overall channel estimates between the SS and the DS are H _(O,l) =H ₂P_(l) H ₁, 1≦l≦L.   (2) In the preferred embodiment, L=3.

Construction of Amplification Matrix Sequence {P_(l),1≦l≦L}

We construct the amplification matrices {P_(l),1≦l≦L} such that T₁=αI_(N) _(r) and

$T_{2} = {\frac{1}{\alpha}I_{N_{r}}}$ are the sole solutions to the following matrix equation group P_(l)=T₂P_(l)T₁, 1≦l≦L,   (3) i.e., a solution for the matrix group equations have one degree of freedom.

When P₁=I_(N) _(r) , T₂=T₁ ⁻¹ and Equation (3) can be rewritten as P_(l)T₁=T₁P_(l), 2≦l≦L.   (4)

We define a (L−1)N_(r) ²×N_(r) ² block matrix as

$\begin{matrix} {{B = \begin{bmatrix} I_{N_{r}} & {\otimes P_{2}} & {- P_{2}^{2}} & {\otimes I_{N_{r}}} \\ I_{N_{r}} & {\otimes P_{3}} & {- P_{3}^{T}} & {\otimes I_{N_{r}}} \\ \; & \; & \vdots & \; \\ I_{N_{r}} & {\otimes P_{L}} & {- P_{L}^{T}} & {\otimes I_{N_{r}}} \end{bmatrix}},} & (5) \end{matrix}$ where

 denotes the well known Kronecker product, which is an operation on two matrices of arbitrary size resulting in a block matrix. The rank of block matrix B is N_(r) ²−1.

Equation (5) can be rewritten as B.t₁=0,   (6) where t₁=vec(T₁) denotes a vectorization of T₁ formed by stacking the columns of matrix T₁ into a single column vector. The sole solution to equation (6), is T₁=αI_(N) _(r) when the rank of block matrix B is N_(r) ²−1.

Therefore, we set the amplification matrix to P₁=I_(N) _(r) , and then determine the sequence {P_(l),2≦l≦L} such that the rank of the block matrix B is N_(r) ²−1.

We define the eigenvector clusters of the amplification matrices {P_(l),2≦l≦L} as follows. We perform an eigenvalue decomposition on each amplification matrix to obtain P _(l) =V _(l)Λ_(l) V _(l) ⁻¹, 2≦l≦L,   (7) where V_(l)=(v_(l1,) v_(l2), . . . , v_(lN) _(r) ) denotes the eigenvector matrix of amplification matrix P_(l), and V_(ln) denotes the n^(th) eigenvector of matrix P_(l). We group the N_(r) eigenvectors of matrix P_(l) into K clusters with n_(k) eigenvectors in the k^(th) cluster V_(lk), for 1≦k≦K, such that the vector V_(lk) for different intervals l span the same n_(k)-dimensional space S_(k).

In the case that the matrix P_(l) has an n-dimensional (n>1) eigenspace corresponding to an n-order (repeated) eigenvalue, n arbitrary eigenvectors are selected from this eigenspace for grouping.

Given the above eigenvector grouping, our invention equivalently sets P₁=I_(N) _(r) and designs the sequence {P_(l),2≦l≦L} such that a maximum number of their eigenvector clusters is one. The amplification matrix sequences {P_(l),1≦l≦L} and {RP_(l)S, 1≦l≦L}, where R and S are arbitrary N_(r)×N_(r) invertible matrices, are equivalent. If one of sequence qualifies as an amplification matrix sequence candidate, the other sequence also qualifies.

Our invention provides the following procedure for constructing diagonal or quasi-diagonal amplification matrices, P₁, P₂, and P₃, for interim channel estimation within three time intervals 301. Our diagonal or quasi-diagonal amplification matrices reduce the complexity of the RS.

Procedure

The first amplification matrix is P₁=I_(N) _(r) ;

Randomly generate N_(r) distinct complex numbers, each with unit magnitude, to obtain the second (diagonal) amplification matrix P₂;

Obtain the third amplification matrix P₃ by cyclically shifting the columns of the second matrix P₂.

Linear Least Square (LS) Estimation of Interim Channels

Under the condition that N_(r)=min{N_(s), N_(d)}, our invention transforms a set of non-linear matrix equation group with respect to H₁ and H₂ in (2) into a linear equation. Then, the estimate of the matrices H₁ and H₂ is obtained as the LS solution to this linear equation.

Case I: N_(d)≧N_(s)=N_(r)

In this case, H₁ is an N_(r)×N_(r) square matrix, and, according to Equation (2), H ₂ =H _(O,l) H ₁ ⁻¹ P _(l) ⁻¹, 1≦l≦L   (8), which, after eliminating H₂, can be rewritten as A _(l) ^(I) H ₁ −H ₁ B _(l) ^(I)=0, 2≦l≦L,   (9) where A_(l) ^(I)=P₁ ⁻¹P_(l) and B_(l) ^(I)=(H_(O,1) ^(H)H_(O,1))⁻¹ H_(O,1) ^(H)H_(O,l).

Case II: N_(s)≧N_(d)=N_(r)

In this case, H₂ is an N_(r)×N_(r) square matrix, and, according to Equation (2), H ₁ =P _(l) ⁻¹ H ₂ ⁻¹ H _(O,l), 1≦l≦L,   (10) which, after eliminating H₁, can be rewritten as A _(l) ^(II) ₂ −H ₂ B _(l) ^(II)=0, 2≦l≦L,   (11) where A_(l) ^(II)=H_(O,l)H_(O,1) ^(H)(H_(O,1)H_(O,1) ^(H))⁻¹ and B_(l) ^(II)=P_(l)P₁ ⁻¹.

Thus, the general set of linear matrix equations under the condition that N_(r)=min{N_(s), N_(d)}is A _(l) H _(x) −H _(x) B _(l)=0, 2≦l≦L   (12) where

$\begin{matrix} {H_{x} = \left\{ {\begin{matrix} H_{1} & {{Case}{\mspace{11mu}\;}I} \\ H_{2} & {{Case}\mspace{14mu}{II}} \end{matrix},} \right.} & (13) \end{matrix}$ and

$\begin{matrix} {A_{l} = \left\{ {\begin{matrix} {P_{1}^{- 1}P_{l}} & {{Case}\mspace{14mu} I} \\ {H_{O,l}{H_{O,1}^{H}\left( {H_{O,1}H_{O,1}^{H}} \right)}^{- 1}} & {{Case}\mspace{14mu}{II}} \end{matrix},} \right.} & (14) \end{matrix}$ and

$\begin{matrix} {B_{l} = \left\{ {\begin{matrix} {\left( {H_{O,1}^{H}H_{O,1}} \right)^{- 1}H_{O,1}^{H}H_{O,1}} & {{Case}\mspace{14mu} I} \\ {P_{l}P_{1}^{- 1}} & {{Case}\mspace{14mu}{II}} \end{matrix}.} \right.} & (15) \end{matrix}$

We denote H_(EO,l) as an estimate of H_(O,l), 1≦l≦L. We replace H_(O,l) with H_(EO,l) in Equation (14) and (15), then Equation (12) can be rewritten as the set of equations A _(l) ^(E) H _(x) −H _(x) B _(l) ^(E) +N _(l)=0, 2≦l≦L,   (16) where N_(l) denotes a noise matrix due to imperfect overall channel estimation,

$\begin{matrix} {A_{l}^{E} = \left\{ {\begin{matrix} {P_{1}^{- 1}P_{l}} & {{Case}{\mspace{11mu}\;}I} \\ {H_{{EO},l}{H_{{EO},1}^{H}\left( {H_{{EO},1}H_{{EO},1}^{H}} \right)}^{- 1}} & {{Case}\mspace{14mu}{II}} \end{matrix},} \right.} & (17) \end{matrix}$ and

$\begin{matrix} {B_{l}^{E} = \left\{ {\begin{matrix} {\left( {H_{{EO},1}^{H}H_{{EO},1}} \right)^{- 1}H_{{EO},1}^{H}H_{{EO},l}} & {{Case}\mspace{14mu} I} \\ {P_{l}P_{1}^{- 1}} & {{Case}\mspace{14mu}{II}} \end{matrix}.} \right.} & (18) \end{matrix}$

The set of equations (16) can be rewritten as (I _(N) _(r)

A _(l) ^(E)−(B _(l) ^(E))^(T)

I _(n) _(r) )h _(x) +n _(l)=0, 2≦l≦L,   (19) where h_(x)=(h_(x1), h_(x2), . . . , h_(xN) _(r) ₂ )^(T) and n_(l)=(n_(l1), n_(l2), . . . , n_(lN) _(r) ₂ )^(T) denote the vectorization of H₁ and N_(l) formed by stacking the columns of H₁ and N_(l) into a single column vector, respectively. Without loss of generality, the values of h_(x) normalized to h_(xl),

${h_{x,n} = \frac{h_{x}}{h_{x\; 1}}},$ is obtained by solving the following linear set of equations, C h_(x,n) +n=y,   (20) where n=(n₂ ^(T), n₃ ^(T), . . . , n_(L) ^(T), 0)^(T) and y=[0, 0, . . . , 0, 1]^(T) are N_(r) ²+1-dimensional column vectors, and

$\begin{matrix} {C = \begin{bmatrix} I_{N_{r}} & \otimes & {A_{2}^{E} -} & \left( B_{2}^{E} \right)^{T} & {\otimes I_{N_{r}}} \\ I_{N_{r}} & \otimes & {A_{3}^{E} -} & \left( B_{3}^{E} \right)^{T} & {\otimes I_{N_{r}}} \\ \; & \; & \vdots & \; & \; \\ I_{N_{r}} & \otimes & {A_{L}^{E} -} & \left( B_{L}^{E} \right)^{T} & {\otimes I_{N_{r}}} \\ {1,} & 0 & {0,} & {\cdots,} & 0 \end{bmatrix}} & (21) \end{matrix}$ is an ((L−1) N_(r) ²+1)×N_(r) ² matrix.

Using the least square procedure, the estimate of h_(x,n) is ĥ _(x,n,LS)=(C ^(H) C)⁻¹ C ^(H) y.   (22)

After one of matrix H₁ and H₂ is estimated from Equation (22), the other matrix can be estimated based on Equation (8) for Case I, or Equation (10) for Case II.

The Estimation of H₁ and H₂ When N_(r)>min{N_(s), N_(d)}

When N_(r)>min{N_(s)N_(d)}, our invention partitions the estimation of the interim channels into multiple steps while the estimation for Case I or II, as described above, are applied in each step.

Specifically, when N_(r)>min {N_(s), N_(d)}, we partition the receive and transmit antenna pairs at the RS into multiple groups so that N_(r)′=min{N_(s), N_(d)} where N_(r)′ denotes the number of antenna pairs in each group. By grouping the receive and transmit antenna pairs at the RS, the original N_(s)/N_(r)/N_(d) two-hop MIMO AF relay network i.e., N_(s) transmit antennas at the SS, N_(r) receive and transmit antenna pairs at the RS, and N_(d) receive antennas at the DS, is partitioned into K parallel N_(s)/N_(r)′/N_(d) subnetworks, where K denotes the number of antenna groups. When transmitting and receiving with the group of antennas, the group of antennas effectively form a subnetwork for which the estimating is done.

To ensure that there are N_(r)′ antenna pairs in each group, and more important, to obtain the amplitude and phase relationship between the interim channels of the different subnetworks, there are overlapping antenna pairs in different groups.

Because N_(r)′=min{N_(s), N_(d)}, the interim channels can be estimated by the estimation process for Case I or II above by only enabling the required receive and transmit antenna pairs of the RS. Afterwards, the overall interim channels are obtained by combining the estimates for interim channels.

An example below describes the interim channels estimation when N_(r)>min{N_(s), N_(d)}. Consider a two-hop MIMO AF relay network with SS antennas N_(s)=2, RS antennas N_(r)=4, and DS antennas N_(d)=4. Because N_(r)′=min{2,4}=2, there are two receive and transmit antenna pairs in each group at the RS.

To obtain the amplitude and phase relationship between the interim channels, the four antenna pairs at the RS, p₁, p₂, p₃, and p₄ are partitioned into three groups, e.g., p₁ and p₂ form Group 1, p₃ and p₄ form Group 2, and p₁ and p₃ form Group 3.

Overlapping between different groups is utilized to determine the amplitude and phase relationship between the interim channels of the different subnetworks. Therefore, it is unnecessary that every two groups have overlapping antenna pairs.

The interim channels for each group are estimated as for Case I above, and afterwards the overall interim channels are obtained by combining the estimates for the interim channels appropriately.

Our invention is applicable to the case wherein the RS serves one or multiple DS. For the multi-user case, the RS applies the same amplifying matrix sequence for different MS, and each MS performs the estimation of its interim channels independently.

FIG. 4 shows the overall method 1 for estimating channels in a two-hop multi-input-multi-output (MIMO) amplify-and-forward (AF) relay network including a source station (SS), a relay station (RS), and a destination station (DS), wherein there is a first interim channel between the SS and the RS, a second interim channel between the RS and the DS, and an overall channel between the SS and DS.

We transmit 410 using the first interim channel, a signal from the SS to the RS. We forward 420 the signal while amplifying and varying a power amplifying matrix during consecutive time intervals. We estimate 430 the overall channel during each time interval a the DS, and then estimate 440 the first interim channel and the second interim channel based on the estimates of the overall channels obtained during the consecutive time intervals.

Although the invention has been described by way of examples of preferred embodiments, it is to be understood that various other adaptations and modifications may be made within the spirit and scope of the invention. Therefore, it is the object of the appended claims to cover all such variations and modifications as come within the true spirit and scope of the invention. 

1. A method for estimating channels in a two-hop multi-input-multi-output (MIMO) amplify-and-forward (AF) relay network including a source station (SS), a relay station (RS), and a destination station (DS), wherein there is a first interim channel between the SS and the RS, a second interim channel between the RS and the DS, and an overall channel between the SS and DS, comprising the steps of: transmitting, using the first interim channel, a signal from the SS to the RS; amplifying, in the RS, the signal, while varying a power amplifying matrix during consecutive time intervals; forwarding, using the second interim channel, the amplified signal from the RS to the DS during the consecutive time intervals; estimating, in the DS, the overall channel during each time interval; estimating the first interim channel and the second interim channel based on the estimates of the overall channels obtained during the consecutive time intervals, and wherein each estimate of the overall channel is in a form of a non-linear equation, and further comprising: transforming the non-linear equations to a single linear equation; and solving the single linear equation using a low-complexity linear least square estimation process to obtain the estimates of the first and second interim channels.
 2. The method of claim 1, further comprising: selecting antennas for transmitting signal from the SS to the DS according to the estimates of the first interim channel and the second interim channel.
 3. The method of claim 1, wherein pilot signals transmitted by the SS to the RS are only amplified by the RS before retransmitting the amplified pilot signals to the DS.
 4. The method of claim 1, wherein an overall channel matrix is H_(O)=H₂P_(L)H₁, for 1≦l≦L, wherein H₁ is a channel matrix for the first interim channel, H₂ is a the channel matrix for the second interim channel, and P_(L) is the power amplifying matrix.
 5. The method of claim 4, wherein L=3.
 6. The method of claim 1, wherein a first amplification matrix is P₁=I_(N) _(r) , wherein I is an identity matrix, and N_(r) is a number of antennas at the RS, and further comprising: generating randomly N_(r) complex numbers, each with unit magnitude to obtain a second power amplification matrix P₂ ; an shifting cyclically columns of the second matrix P₂ to obtain a the third amplification matrix P₃.
 7. The method of claim 1, wherein receive and transmit antennas at the RS are partitioned into multiple groups, and the estimating steps are performed for each group.
 8. The method of claim 7, wherein the number of the receive and transmit antennas in each group equals the smaller one of the number of antennas at the SS and the number of antennas at the DS.
 9. The method of claim 7, wherein there are overlapping receive and transmit antenna pairs in the different groups.
 10. The method of claim 7 wherein each group of antennas forms a subnetwork, and antennas, and the receive and transmit antennas at the RS that are outside the subnetwork are switched off.
 11. The method of claim 7, wherein each group includes a pair of antennas.
 12. The method of claim 1, wherein, when estimating steps are performed periodically.
 13. The method of claim 1, wherein, a solution for the single linear equation has one degree of freedom.
 14. The method of claim 10, wherein during the estimating of the interim channels of each subnetwork, the overall channels of this subnetworks involving different amplifying matrices of the RS are obtained at the DS or the SS. 